Ant Colony Optimization algorithm for determining the shortest routes to reduce distribution costs
نویسندگان
چکیده
Distribution is an important activity that companies need to pay attention to. Improper planning for distribution activities can potentially waste both cost and time. Determining the shortest route could help effectively reduce costs. This research was conducted on a small medium enterprise (SME) located in Rangkasbitung, Indonesia sells various types of bread. carried out by Jaya Roti were found be still conventional, while city Serang has many locations complex combinations. utilized metaheuristic method Ant Colony Optimization (ACO) with MATLAB software determine route, which included Travel Salesman Problem (TSP). The result determination total distance 93,484 Km efficiency rate 26.97% resulting IDR 170,795.
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملAnt Colony Optimization Algorithm
Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.
متن کاملAnt Colony Optimization Algorithm for Continuous Domains Based on Position Distribution Model of Ant Colony Foraging
Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model an...
متن کاملMulti-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal Industrial Servicess
سال: 2023
ISSN: ['2461-0623', '2461-0631']
DOI: https://doi.org/10.36055/jiss.v9i1.19022